Self-Stabilizing Distributed File Systems
نویسندگان
چکیده
A self-stabilizing distributed file system is presented. The system constructs and maintains a spanning tree for each file volume. The spanning tree consists of the servers that have volume replicas and caches for the specific file volume. The spanning trees are constructed and maintained by selfstabilizing distributed algorithms. File system updates use the tree to implement file read and write operations.
منابع مشابه
Guest Editorial Self - Stabilizing Systems , Part 2
In the Fall of 2002, Joffroy Beauquier and Colette Johnen (at the Université Paris-Sud) organized an International Seminar on Self-Stabilization at Luminy, France. The seminar, which was sponsored by the Centre International de Rencontres Mathématiques, was a great success uncovering new research directions concerning the self-stabilization of network protocols and distributed systems. As it ha...
متن کاملLinear Time Byzantine Self-Stabilizing Clock Synchronization
Awareness of the need for robustness in distributed systems increases as distributed systems become an integral part of day-to-day systems. Tolerating Byzantine faults and possessing self-stabilizing features are sensible and important requirements of distributed systems in general, and of a fundamental task such as clock synchronization in particular. There are efficient solutions for Byzantin...
متن کاملStudying Network Optimization in the Context of Self-Stabilization
Self-stabilization is a theoretical framework of nonmasking fault-tolerance for distributed networks. A self-stabilizing system is capable of tolerating any unexpected transient fault without outside intervention and, regardless of the initial state, it can converge to a legitimate global state, a predefined vector of local states, in finite time. Self-stabilization has rendered a good problem ...
متن کاملSafe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground
Self-stabilizing systems can be started in any arbitrary state and converge to exhibit the desired behavior. However, self-stabilizing systems can be started in predefined initial states, in the same way as non-stabilizing systems. In this case, a self-stabilizing system can mask faults just like any other distributed system. Moreover, whenever faults overwhelm the systems beyond their capabili...
متن کاملMechanical Verification of Self-Stabilizing Distributed Systems
Self-stabilizing distributed systems are a class of distributed systems which converge to correct system states even if they start from arbitrary system states. A self-stabilizing system can recover from finite number of transient faults (e.g., message loss, memory corruption). Therefore, they are fault-tolerant systems. When we design a self-stabilizing system, its verification, such as conver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002